Efficient compiler and run-time support for parallel irregular reductions
Identifieur interne : 000328 ( Main/Exploration ); précédent : 000327; suivant : 000329Efficient compiler and run-time support for parallel irregular reductions
Auteurs : Hwansoo Han [États-Unis] ; Chau-Wen Tseng [États-Unis]Source :
- Parallel Computing [ 0167-8191 ] ; 2000.
Abstract
Many scientific applications are comprised of irregular reductions on large data sets. In shared-memory parallel programs, these irregular reductions are typically computed in parallel using replicated buffers, then combined using synchronization. We develop LocalWrite, a new technique which partitions irregular reductions so that each processor computes values only for locally assigned data, eliminating the need for buffers or synchronized writes. Computation is replicated if its results are needed on multiple processors. We experimentally evaluate its performance for three irregular codes on a software DSM running on a distributed-memory multiprocessor and two shared-memory multiprocessors while varying connectivity, locality, and adaptivity. Results show LocalWrite improves performance significantly compared to using replicated buffers, and can match or exceed explicit message-passing gather/scatter for applications with low locality or high adaptivity.
Url:
DOI: 10.1016/S0167-8191(00)00062-4
Affiliations:
Links toward previous steps (curation, corpus...)
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Efficient compiler and run-time support for parallel irregular reductions</title><author><name sortKey="Han, Hwansoo" sort="Han, Hwansoo" uniqKey="Han H" first="Hwansoo" last="Han">Hwansoo Han</name></author><author><name sortKey="Tseng, Chau Wen" sort="Tseng, Chau Wen" uniqKey="Tseng C" first="Chau-Wen" last="Tseng">Chau-Wen Tseng</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:0EC5A44BA923EF557D5A470D4F78433FD027FB42</idno><date when="2000" year="2000">2000</date><idno type="doi">10.1016/S0167-8191(00)00062-4</idno><idno type="url">https://api.istex.fr/document/0EC5A44BA923EF557D5A470D4F78433FD027FB42/fulltext/pdf</idno><idno type="wicri:Area/Main/Corpus">001002</idno><idno type="wicri:explorRef" wicri:stream="Main" wicri:step="Corpus" wicri:corpus="ISTEX">001002</idno><idno type="wicri:Area/Main/Curation">001002</idno><idno type="wicri:Area/Main/Exploration">000328</idno><idno type="wicri:explorRef" wicri:stream="Main" wicri:step="Exploration">000328</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Efficient compiler and run-time support for parallel irregular reductions</title><author><name sortKey="Han, Hwansoo" sort="Han, Hwansoo" uniqKey="Han H" first="Hwansoo" last="Han">Hwansoo Han</name><affiliation wicri:level="4"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science, University of Maryland, College Park, Maryland, MD 20742</wicri:regionArea><placeName><region type="state">Maryland</region><settlement type="city">College Park (Maryland)</settlement></placeName><orgName type="university">Université du Maryland</orgName></affiliation></author><author><name sortKey="Tseng, Chau Wen" sort="Tseng, Chau Wen" uniqKey="Tseng C" first="Chau-Wen" last="Tseng">Chau-Wen Tseng</name><affiliation wicri:level="4"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science, University of Maryland, College Park, Maryland, MD 20742</wicri:regionArea><placeName><region type="state">Maryland</region><settlement type="city">College Park (Maryland)</settlement></placeName><orgName type="university">Université du Maryland</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Parallel Computing</title><title level="j" type="abbrev">PARCO</title><idno type="ISSN">0167-8191</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="2000">2000</date><biblScope unit="volume">26</biblScope><biblScope unit="issue">13–14</biblScope><biblScope unit="page" from="1861">1861</biblScope><biblScope unit="page" to="1887">1887</biblScope></imprint><idno type="ISSN">0167-8191</idno></series><idno type="istex">0EC5A44BA923EF557D5A470D4F78433FD027FB42</idno><idno type="DOI">10.1016/S0167-8191(00)00062-4</idno><idno type="PII">S0167-8191(00)00062-4</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0167-8191</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Many scientific applications are comprised of irregular reductions on large data sets. In shared-memory parallel programs, these irregular reductions are typically computed in parallel using replicated buffers, then combined using synchronization. We develop LocalWrite, a new technique which partitions irregular reductions so that each processor computes values only for locally assigned data, eliminating the need for buffers or synchronized writes. Computation is replicated if its results are needed on multiple processors. We experimentally evaluate its performance for three irregular codes on a software DSM running on a distributed-memory multiprocessor and two shared-memory multiprocessors while varying connectivity, locality, and adaptivity. Results show LocalWrite improves performance significantly compared to using replicated buffers, and can match or exceed explicit message-passing gather/scatter for applications with low locality or high adaptivity.</div></front></TEI><affiliations><list><country><li>États-Unis</li></country><region><li>Maryland</li></region><settlement><li>College Park (Maryland)</li></settlement><orgName><li>Université du Maryland</li></orgName></list><tree><country name="États-Unis"><region name="Maryland"><name sortKey="Han, Hwansoo" sort="Han, Hwansoo" uniqKey="Han H" first="Hwansoo" last="Han">Hwansoo Han</name></region><name sortKey="Tseng, Chau Wen" sort="Tseng, Chau Wen" uniqKey="Tseng C" first="Chau-Wen" last="Tseng">Chau-Wen Tseng</name><name sortKey="Tseng, Chau Wen" sort="Tseng, Chau Wen" uniqKey="Tseng C" first="Chau-Wen" last="Tseng">Chau-Wen Tseng</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/AussoisV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000328 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000328 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/France
|area= AussoisV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:0EC5A44BA923EF557D5A470D4F78433FD027FB42
|texte= Efficient compiler and run-time support for parallel irregular reductions
}}
| This area was generated with Dilib version V0.6.29. |  |